Neighbor joining with phylogenetic diversity estimates
نویسندگان
چکیده
The Neighbor-Joining algorithm is a recursive procedure for reconstructing trees that is based on a transformation of pairwise distances between leaves. We present a generalization of the neighborjoining transformation, which uses estimates of phylogenetic diversity rather than pairwise distances in the tree. This leads to an improved neighbor-joining algorithm whose total running time is still polynomial in the number of taxa. On simulated data, the method outperforms other distance-based methods. We have implemented neighbor-joining for subtree weights in a program called MJOIN which is freely available under the Gnu Public License at http://bio.math.berkeley.edu/mjoin/
منابع مشابه
Beyond pairwise distances: neighbor-joining with phylogenetic diversity estimates.
The "neighbor-joining algorithm" is a recursive procedure for reconstructing trees that is based on a transformation of pairwise distances between leaves. We present a generalization of the neighbor-joining transformation, which uses estimates of phylogenetic diversity rather than pairwise distances in the tree. This leads to an improved neighbor-joining algorithm whose total running time is st...
متن کاملPivotal Neighbor Joining Algorithms for Inferring Phylogenies via LCA-Distances
Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical considerations. We study algorithms which are based on a characterization of weighted trees by distances to LCAs (Least Common Ancestors). This characterization combines the theoretical advantages of ultrametrics, with the prac...
متن کاملGenetic diversity of four protected indigenous chicken breeds in China using microsatellite markers
The genetic diversity of four protected indigenous chicken breeds was evaluated with 25 microsatellite markers. Polymorphism information content (PIC), heterozygosity with the estimator of genetic differentiation FST and Nei’s genetic distance were evaluated. The results showed that these four protected local chicken populations showed high levels of diversity. The proportion of inter-populatio...
متن کاملA simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates.
Using simulated data, we compared five methods of phylogenetic tree estimation: parsimony, compatibility, maximum likelihood, Fitch-Margoliash, and neighbor joining. For each combination of substitution rates and sequence length, 100 data sets were generated for each of 50 trees, for a total of 5,000 replications per condition. Accuracy was measured by two measures of the distance between the t...
متن کاملconstNJ: An Algorithm to Reconstruct Sets of Phylogenetic Trees Satisfying Pairwise Topological Constraints
This article introduces constNJ (constrained neighbor-joining), an algorithm for phylogenetic reconstruction of sets of trees with constrained pairwise rooted subtree-prune-regraft (rSPR) distance. We are motivated by the problem of constructing sets of trees that must fit into a recombination, hybridization, or similar network. Rather than first finding a set of trees that are optimal accordin...
متن کامل